Truncated primal-dual iterative methods for large-scale nonlinear least squares

نویسنده

  • S. Gratton
چکیده

Data assimilation covers techniques where prediction of the state of a dynamical systems is performed using data from various origins. We consider here the optimization problem that lies in the centre of this technique, when so-called variational formulations are considered. Our main interest will be focused on case where the dynamical systems under consideration is described by stochastic differential equations. Such a problem is called “Weak-constrained variational Data Assimilation”. We will compare the merits of the three main approaches that are considered by the community: state, forcing, saddle-point formulations. They lead to large-scale optimization problems which must be solved iteratively. As it is usually the case in this setting, efficiency will dramatically rely on the ability to design effective parallel implementations of suitably preconditioned, convergent and variationally coherent minimization algorithms. Using these principles we derive a new variant of the saddle point algorithm in which the monotonicity of the likelihood along the iterates is enhanced. A parametric study of the algorithms will be presented both in a sequential and idealized parallel environment on the Burgers equation and on a quasi-Geostrophic model that are considered as representative of real models occurring in Meteorology of Oceanography. We show the merits of our new saddle-point formulation and of more classical ones based on the full orthogonalization method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Avoiding communication in primal and dual block coordinate descent methods

Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration which, on modern data center and supercomputing architectures, often ...

متن کامل

Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems

When solving nonlinear least-squares problems, it is often useful to regularize the problem using a quadratic term, a practice which is especially common in applications arising in inverse calculations. A solution method derived from a trust-region Gauss-Newton algorithm is analyzed for such applications, where, contrary to the standard algorithm, the least-squares subproblem solved at each ite...

متن کامل

The University of Reading Approximate Gauss-Newton methods for nonlinear least squares problems

The Gauss-Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well-suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...

متن کامل

Approximate Gauss-Newton Methods for Nonlinear Least Squares Problems

The Gauss–Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...

متن کامل

A Comparative Study of Ls-svm’s Applied to the Silver Box Identification Problem

Within the context of nonlinear system identification, different variants of LS-SVM are applied to the Silver Box dataset. Starting from the dual representation of the LS-SVM, and using Nyström techniques, it is possible to compute an approximation for the nonlinear mapping to be used in the primal space. In this way, primal space based techniques as Ordinary Least Squares (OLS), Ridge Regressi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017